Deadline scheduling of multiprocessor tasks
نویسندگان
چکیده
منابع مشابه
Deadline Scheduling of Multiprocessor Tasks
In the classical scheduling theory it is widely assumed that any task requires for its processing only one processor at a time. Nowadays with the technological progress this assumption has become not so obvious. In the paper, two algorithms for solving the problem of scheduling tasks requiring more than one processor at a time in the real-time environment, will be given. The first is based on a...
متن کاملComparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor
Multiprocessor architecture becomes common on realtime systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these algorithms are necessary. In this paper, we compare EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, ...
متن کاملA 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks
We present a new approximation algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines. We prove that for an arbitrary parameter k E N it yields solutions with at most (~ + t )OPT + 9k many processors, thus it gives an asymptotic 3/2-approximation algorithm. This improves over the previously best known ratio of 7/4. Our algorithm can be implemented to ru...
متن کاملDeadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
This paper presents a scheduling technique used to optimize computation speed of loops running on architectures that may include pipelined dedicated processors. The problem under consideration is to find an optimal periodic schedule satisfying the timing constraints. Motivated by FPGA (Field-Programmable Gate Array) architecture we formulate a problem of cyclic scheduling on one dedicated proce...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00020-r